|
SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets. It was originally developed by Jack Schwartz at the NYU Courant Institute of Mathematical Sciences in the late 1960s. David Bacon, who was previously a PhD student in NYU with Jack Schwartz still actively maintains the compiler for SETL and its website. == Design == SETL provides two basic aggregate data types: ''unordered sets'', and ''sequences'' (the latter also called ''tuples''). The elements of sets and tuples can be of any arbitrary type, including sets and tuples themselves. ''Maps'' are provided as sets of ''pairs'' (i.e., tuples of length 2) and can have arbitrary domain and range types. Primitive operations in SETL include set membership, union, intersection, and power set construction, among others. SETL provides quantified boolean expressions constructed using the universal and existential quantifiers of first-order predicate logic. SETL provides several iterators to produce a variety of loops over aggregate data structures. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「SETL」の詳細全文を読む スポンサード リンク
|